Asymmetric Index Management Scheme for High-capacity Compressed Databases
نویسندگان
چکیده
منابع مشابه
A Compressed Self-Index for Genomic Databases
Advances in DNA sequencing technology will soon result in databases of thousands of genomes. Within a species, individuals’ genomes are almost exact copies of each other; e.g., any two human genomes are 99.9% the same. Relative Lempel-Ziv (RLZ) compression takes advantage of this property: it stores the first genome uncompressed or as an FM-index, then compresses the other genomes with a varian...
متن کاملA High Capacity Email Steganography Scheme using Dictionary
The main objective of steganography is to conceal a secret message within a cover-media in such a way that only the original receiver can discern the presence of the hidden message. The cover-media can be a text, email, audio, image, and video, which can be transmitted through a public channel, such as the Internet. By extending the use of email among Internet users, the provision of email steg...
متن کاملA High-Quality Image Authentication Scheme for AMBTC-compressed Images
In this paper, we present a high-quality image authentication scheme based on absolute moment block truncation coding. In the proposed scheme, we use the parity of the bitmap (BM) to generate the authentication code for each compressed image block. Data hiding is used to authenticate whether the content has been altered or not. For image authentication, we embed the authentication code to quant...
متن کاملCompressed Pattern Databases
A pattern database (PDB) is a heuristic function implemented as a lookup table that stores the lengths of optimal solutions for subproblem instances. Standard PDBs have a distinct entry in the table for each subproblem instance. In this paper we investigate compressing PDBs by merging several entries into one, thereby allowing the use of PDBs that exceed available memory in their uncompressed f...
متن کاملA Proposal of Index for High-dimensional Static Databases
As a member of R-tree family, R*-tree is widely used in multimedia databases and spatial databases, in which NN (Nearest Neighbor) search is very popular. According to our investigations, (1) the degree of objects clustering in the leaf nodes is a very important factor on performance of NN search; (2) Normally, in R*-tree, its objects are not well-clustered in their leaf nodes. This paper propo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Korea Academia-Industrial cooperation Society
سال: 2016
ISSN: 1975-4701
DOI: 10.5762/kais.2016.17.7.293